منابع مشابه
The mixed general routing polyhedron
In Arc Routing Problems, ARPs, the aim is to find on a graph a minimum cost traversal satisfying some conditions related to the links of the graph. Due to restrictions to traverse some streets in a specified way, most applications of ARPs must be modeled with a mixed graph. Although several exact algorithms have been proposed, no polyhedral investigations have been done for ARPs on a mixed grap...
متن کاملTheory and Methodology The general routing polyhedron: A unifying framework
It is shown how to transform the General Routing Problem (GRP) into a variant of the Graphical Travelling Salesman Problem (GTSP). This transformation yields a projective characterisation of the GRP polyhedron. Using this characterisation, it is shown how to convert facets of the GTSP polyhedron into valid inequalities for the GRP polyhedron. The resulting classes of inequalities subsume severa...
متن کاملThe Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of traversing it in each direction. In this paper we deal with the Windy General Routing Problem (WGRP), in which only a subset of edges must be traversed and a subset of vertices must be visited. This is also an NP-hard ...
متن کاملThe mixed capacitated general routing problem under uncertainty
We study the General Routing Problem defined on a mixed graph and with stochastic demands. The problem under investigation is aimed at finding the minimum cost set of routes to satisfy a set of clients whose demand is not deterministically known. Since each vehicle has a limited capacity, the demand uncertainty occurring at some clients affects the satisfaction of the capacity constraints, that...
متن کاملThe mixed capacitated general routing problem with turn penalties
0957-4174/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.eswa.2011.04.092 ⇑ Corresponding author. Tel.: +34963877007x7666 E-mail addresses: [email protected] (O. Bräy Martínez), [email protected] (Y. Nagata), dsole In this paper we deal with the mixed capacitated general routing problem with turn penalties. This problem generalizes many important arc and node routing proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2003
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-003-0391-9